Solving Constraint Optimization Problems in Anytime Contexts
نویسندگان
چکیده
This paper presents a new hybrid method for solving constraint optimization problems in anytime contexts. Discrete optimization problems are modelled as Valued CSP. Our method (VNS/LDS+CP) combines a Variable Neighborhood Search and Limited Discrepancy Search with Constraint Propagation to efficiently guide the search. Experiments on the CELAR benchmarks demonstrate significant improvements over other competing methods. VNS/LDS+CP has been successfully applied to solve a real-life anytime resource allocation problem in computer networks.
منابع مشابه
VNS/LDS+CP : A Hybrid Method for Constraint Optimization in Anytime Contexts
In many decision problems (planning, scheduling, resource allocation), the objective is to find a good solution which satisfies a set of hard (or imperative) constraints, and satisfies as well as possible a set of soft constraints expressing costs, utilities, preferences. Such problems can be referred to as Constraint Optimization Problems, and are often translated to Valued Constraint Satisfac...
متن کاملOptimum Anytime Bounding for Constraint Optimization Problems
In this paper, we consider Constraint Optimization Problems in a Resource-Bounded context. We observe that both exact and approximate methods produce only an anytime upper bound of the optimum (in case of minimization). No lower bound, and thus no quality is available at run time. For a meta-reasoning system, it is difficult to reason on the basis of a so poor piece of information. Therefore, w...
متن کاملExplorative anytime local search for distributed constraint optimization
Distributed Constraint Optimization Problems (DCOPs) are an elegant model for representing and solving many realistic combinatorial problems that are distributed by nature. DCOPs are NP-hard and therefore many recent studies consider incomplete algorithms for solving them. Distributed local search algorithms, in which agents in the system hold value assignments to their variables and iterativel...
متن کاملAnytime local search for distributed constraint optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small problems. Distributed local search algorithms can be used for solving DisCOPs. However, because of the differences between the global evaluation of a system’s state and the private evaluation of states by agents, agents ar...
متن کاملAnytime Local Search for Distributed Constraint Optimization (Short Paper)
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small problems. Distributed local search algorithms can be used for solving DisCOPs. However, because of the differences between the global evaluation of a system’s state and the private evaluation of states by agents, agents ar...
متن کامل